Efficient Computation of Power Indices for Weighted Majority Games
نویسنده
چکیده
Power indices of weighted majority games are measures of the effects of parties on the voting in a council. Among the many kinds of power indices, Banzhaf index, Shapley-Shubik index and Deegan-Packel index have been studied well. For computing these power indices, dynamic programming algorithms had been proposed. The time complexities of these algorithms are O(nq), O(nq), and O(nq), respectively. We propose new algorithms for computing power indices, whose time complexities are O(nq), O(nq), and O(nq), respectively.
منابع مشابه
A Survey on the Computation of Power Indices
A ‘power index’ is a concept in cooperative game theory. Power indices are used as a measure for the influence that a player has in a certain class of cooperative games called simple games. As the title says, this is a survey on how to compute these power indices. Generally speaking, computing these indices is a tedious task, even for relatively small cooperative games. It is certainly intracta...
متن کاملNP-completeness for calculating power indices of weighted majority games
In this paper, we prove that both problems for calculating the Banzhaf power index and the Shapley-Shubik power index for weighted majority games are NP-complete.
متن کاملComputation of several power indices by generating functions
In this paper we propose methods to compute the Deegan-Packel, the Public Good, and the Shift power indices by generating functions for the particular case of weighted voting games. Furthermore, we define a new power index which combines the ideas of the Shift and the Deegan-Packel power indices and also propose a method to compute it with generating functions. We conclude by some comments abou...
متن کاملPower in Weighted Majority Games
This paper suggests an indicator of power in weighted majority games. An indicator of power determines the ability of a voter to influence the outcomes of the voting bodies he belongs to. In a weighted majority game each voter is assigned a certain nonnegative real number weight and there is a positive real number quota satisfying a boundedness condition such that a group of voters can pass a r...
متن کاملThe cost of principles: analyzing power in compatibility weighted voting games
We propose Compatibility Weighted Voting Games, a variant of Weighted Voting Games in which some pairs of agents are compatible and some are not. In a Weighted Voting Game each agent has a weight, and a set of agents can form a winning coalition if the sum of their weights is at least a given quota. Whereas the original Weighted Voting Game model assumes that all agents are compatible, we consi...
متن کامل